Polyhedral approximation in mixed-integer convex optimization
نویسندگان
چکیده
منابع مشابه
Polyhedral approximation in mixed-integer convex optimization
Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. In this paper, we intend to provide a broadly accessible introduction to our recent work in developing algorithms and software for this problem class. Our approach is based o...
متن کاملInteger convex minimization by mixed integer linear optimization
Minimizing a convex function over the integral points of a bounded convex set is polynomial in fixed dimension [6]. We provide an alternative, short, and geometrically motivated proof of this result. In particular, we present an oraclepolynomial algorithm based on a mixed integer linear optimization oracle.
متن کاملA Unifying Polyhedral Approximation Framework for Convex Optimization
We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, but also includes new methods and new versions/extensions of old methods, such as a simplicial decomposition method for nondifferentiable optimization and a new piecewise linear approximation method for convex single commodity ne...
متن کاملA convex approximation for mixed-integer recourse models
We develop a convex approximation for two-stage mixed-integer recourse models and we derive an error bound for this approximation that depends on all total variations of the probability density functions of the random variables in the model. We show that the error bound converges to zero if all these total variations converge to zero. Our convex approximation is a generalization of the one in C...
متن کاملA convex approximation for mixed-integer recourse models
We develop a convex approximation for two-stage mixed-integer recourse models and we derive an error bound for this approximation that depends on all total variations of the probability density functions of the random variables in the model. We show that the error bound converges to zero if all these total variations converge to zero. Our convex approximation is a generalization of the one in C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2017
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-017-1191-y